New Public-Key Cipher System Based Upon the Diophantine Equations

نویسندگان

  • Chu-Hsing Lin
  • Chin-Chen Chang
  • Richard C. T. Lee
چکیده

The public key system proposed by Lin Chang and Lee is insecure even if used as a private key system Index Terms Public key cryptography knapsack cryptosystems This author s research supported by EPSRC Research Grant No GR H This author acknowledges the support of the Nu eld Foundation This author s research supported by a Lloyd s of London Tercentenary Foundation Research Fellowship In the authors present a public key system based on an integer knap sack problem Following the notation of let D f wg The message block m mn where mi D is encrypted to C Pn i misi where s sn forms the public key The method for choosing si to allow a form of trapdoor decryption is given in We show below that this method produces an insecure cryptosystem Lemma There is a unique m j D such that C m jsj mod qj Proof Clearly a solution exists since noting qj j si for i j

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Public - Key Cipher System Based Upon the Diophantine

A b ~ t r ~ ~ t-A new public-key (two-key) cipher scheme is proposed in this paper. In our scheme, keys can be easily generated. In addition, both encryption and decryption procedures are simple. To encrypt a message, the sender needs to conduct a vector product of the message being sent and the enciphering key. On the other hand, the receiver can easily decrypt it by conducting several multipl...

متن کامل

The key exchange cryptosystem used with higher order Diophantine equations

One-way functions are widely used for encrypting the secret in public key cryptography, although they are regarded as plausibly one-way but have not been proven so. Here we discuss the public key cryptosystem based on the system of higher order Diophantine equations. In this system those Diophantine equations are used as public keys for sender and recipient, and both sender and recipient can ob...

متن کامل

Extension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher

Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...

متن کامل

Multivariate public key cryptosystems from diophantine equations

At CT-RSA 2006, Wang et al. [WYHL06] introduced the MFE cryptosystem, which was subsequently broken by Ding et al. [DHNW07]. Inspired by their work, we present a more general framework for multivariate public key cryptosystems, which combines ideas from both triangular and oil-vinegar schemes. We also propose a new public key cryptosystem, based on Diophantine equations, which implements the fr...

متن کامل

Sharing several secrets based on Lagrange's interpolation formula and Cipher feedback mode

In a multi-secret sharing scheme, several secret values are distributed among a set of n participants.In 2000 Chien et al.'s proposed a (t; n) multi-secret sharing scheme. Many storages and publicvalues required in Chien's scheme. Motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the Lagrange interpolation formula for polynomials andcip...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 44  شماره 

صفحات  -

تاریخ انتشار 1995